Characterizing Quantum Supremacy in Near-Term Devices
نویسندگان
چکیده
Sergio Boixo, Sergei V. Isakov, Vadim N. Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, 4 John M. Martinis, 6 and Hartmut Neven Google Inc., Venice, CA 90291, USA Google Inc., 8002 Zurich, Switzerland QuAIL, NASA Ames Research Center, Moffett Field, CA 94035, USA SGT Inc., 7701 Greenbelt Rd., Suite 400, Greenbelt, MD 20770 Google Inc., Santa Barbara, CA 93117, USA Department of Physics, University of California, Santa Barbara, CA 93106, USA (Dated: August 4, 2016)
منابع مشابه
Quantum information processing with superconducting circuits: a review.
During the last ten years, superconducting circuits have passed from being interesting physical devices to becoming contenders for near-future useful and scalable quantum information processing (QIP). Advanced quantum simulation experiments have been shown with up to nine qubits, while a demonstration of quantum supremacy with fifty qubits is anticipated in just a few years. Quantum supremacy m...
متن کاملQuantum Supremacy and the Complexity of Random Circuit Sampling
A critical milestone on the path to useful quantum computers is quantum supremacy – a demonstration of a quantum computation that is prohibitively hard for classical computers. A leading near-term candidate, put forth by the Google/UCSB team, is sampling from the probability distributions of randomly chosen quantum circuits, which we call Random Circuit Sampling (RCS). In this paper we study bo...
متن کاملThe Quantum Computer Puzzle
Q uantum computers are hypothetical devices, based on quantum physics, which would enable us to perform certain computations hundreds of orders ofmagnitude faster than digital computers. This feature is coined “quantum supremacy”, and one aspect or another of such quantum computational supremacy might be seen by experiments in the near future: by implementing quantum error-correction or by syst...
متن کاملComplexity-Theoretic Foundations of Quantum Supremacy Experiments
In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate “quantum supremacy”: that is, a clear quantum speedup for some task, motivated by the goal of overturning the Extended Church-Turing Thesis as confidently as possible. First, we study the hardness of...
متن کاملThe Classical Complexity of Boson Sampling
We study the classical complexity of the exact Boson Sampling problem where the objective is to produce provably correct random samples from a particular quantum mechanical distribution. The computational framework was proposed by Aaronson and Arkhipov in 2011 as an attainable demonstration of ‘quantum supremacy’, that is a practical quantum computing experiment able to produce output at a spee...
متن کامل